Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
نویسندگان
چکیده
منابع مشابه
Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
Laplacian matrices of graphs arise in large-scale computational applications such as semi-supervised machine learning; spectral clustering of images, genetic data and web pages; transportation network flows; electrical resistor circuits; and elliptic partial differential equations discretized on unstructured grids with finite elements. A Lean Algebraic Multigrid (LAMG) solver of the symmetric l...
متن کاملA fast algebraic multigrid preconditioned conjugate gradient solver
This work presents a new approach for selecting the coarse grids allowing a faster algebraic multigrid (AMG) preconditioned conjugate gradient solver. This approach is based on an appropriate choice of the parameter a considering the matrix density during the coarsening process which implies in a significant reduction in the matrix dimension at all AMG levels. 2005 Elsevier Inc. All rights rese...
متن کاملA Parallel Graph Laplacian Solver
Problems from graph drawing, spectral clustering, network flow and graph partitioning all can be expressed as Laplacian matrices. Theoretically fast approaches to solving these problems exist, but in practice these techniques are slow. Two practical approaches have been proposed and work well in serial. However, as problem sizes increase and single core speeds stagnate, parallelism is essential...
متن کاملEstimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver
Matrices associated with graphs, such as the Laplacian, lead to numerous interesting graph problems expressed as linear systems. One field where Laplacian linear systems play a role is network analysis, e. g. for certain centrality measures that indicate if a node (or an edge) is important in the network. One such centrality measure is current-flow closeness. To allow network analysis workflows...
متن کاملLaplacian Matrix in Algebraic Graph Theory
In this paper we turn to the spectral decomposition of the Laplacian matrix. We show how the elements of the spectral matrix for the Laplacian can be used to construct symmetric polynomials that are permutation invariants. The coefficients of these polynomials can be used as graph features which can be encoded in a vectorial manner. We extend this representation to graphs in which there are una...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2012
ISSN: 1064-8275,1095-7197
DOI: 10.1137/110843563